Generalized penetration depth computation based on kinematical geometry
نویسندگان
چکیده
The generalized penetration depth PD of two overlapping bodies X and Y is the distance between the given colliding position of X and the closest collision-free Euclidean copy Xε to X according to a distance metric. We present geometric optimization algorithms for the computation of PD with respect to an object-oriented metric S which takes the mass distribution of the moving body X into consideration. We use a kinematic mapping which maps rigid body displacements to points of a 6-dimensional manifold M6 in the 12-dimensional space R12 of affine mappings equipped with S. We formulate PD as the solution of the constrained minimization problem of finding the closest point on the boundary of the set of all points of M6 which correspond to colliding configurations. Based on the theory of gliding motions, the closest point with respect to the metric S (⇒ PDS) can be computed with an adapted projected gradient algorithm. We also present an algorithm for the computation of the closest point with respect to the geodesic metric G of M6 induced by S (⇒ PDG). Moreover we introduce two methods for the computation of a collision-free initial guess and give a physical interpretation of PDS and PDG.
منابع مشابه
Efficient Motion Planning using Generalized Penetration Depth Computation
Liangjun Zhang: Efficient Motion Planning using Generalized Penetration Depth Computation. (Under the direction of Dinesh Manocha.) Motion planning is a fundamental problem in robotics and also arises in other applications including virtual prototyping, navigation, animation and computational structural biology. It has been extensively studied for more than three decades, though most practical ...
متن کاملGeometry-driven physical interaction between avatars and virtual environments
We present an interactive technique on virtual contact handling for avatars in virtual environments using geometry-driven physics. If a contact has occurred between an articulated avatar and a virtual environment, the global penetration depth and contact points are estimated based on a fast local penetration depth computation for decomposed convex pieces. The penetration depth and contact infor...
متن کاملSymplectic Geometric Algorithm for Quaternion Kinematical Differential Equation
Solving quaternion kinematical differential equations is one of the most significant problems in the automation, navigation, aerospace and aeronautics literatures. Most existing approaches for this problem neither preserve the norm of quaternions nor avoid errors accumulated in the sense of long term time. We present symplectic geometric algorithms to deal with the quaternion kinematical differ...
متن کاملA Fast and Practical Algorithm for Generalized Penetration Depth Computation
We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the minimal translational and rotational motion that separates the two objects. We formulate the PDg computation based on modeldependent distance metrics using displacement vectors. As a result, our formulation is independent...
متن کاملIntegration of Collision Detection with the Multibody System Library in Modelica
Collision detection and response is one of the most difficult areas in simulation of multibody systems. Two known approaches, the impulse-based method and the force-based (penalty) method, can be applied for multibody simulation in Modelica[13]. The impulse-based method requires instantaneous modification of some variables, but such modification is not always possible in Modelica. The force-bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 26 شماره
صفحات -
تاریخ انتشار 2009